Finding Small Stubborn Sets Automatically
نویسنده
چکیده
State space generation is often needed in the analysis of concurrent and distributed systems. The stubborn set method is one of the techniques that try to alleviate the state space explosion encountered in state space generation. An algorithm for nding a stubborn set having as few enabled transitions as possible is presented. Practicality of the algorithm is motivated with the aid of examples.
منابع مشابه
Stubborn Sets for Fully Observable Nondeterministic Planning
The stubborn set method is a state-space reduction technique, originally introduced in model checking and then transfered to classical planning. It was shown that stubborn sets significantly improve the performance of optimal deterministic planners by considering only a subset of applicable operators in a state. Fully observable nondeterministic planning (FOND) extends the formalism of classica...
متن کاملEfficient Stubborn Sets: Generalized Algorithms and Selection Strategies
Strong stubborn sets have recently been analyzed and successfully applied as a pruning technique for planning as heuristic search. Strong stubborn sets are defined declaratively as constraints over operator sets. We show how these constraints can be relaxed to offer more freedom in choosing stubborn sets while maintaining the correctness and optimality of the approach. In general, many operator...
متن کاملOn Computing Symmetries and Stubborn Sets on Computing Symmetries and Stubborn Sets
In this report, we consider two promising methods for alleviating the state space explosion problem in reachability analysis: the symmetry method and the stubborn set method. We concentrate on the computation of symmetries and stubborn sets. The new algorithms presented in this report help us to save time and space in the symmetry method and to avoid inspecting redundant states in the so called...
متن کاملThe Relative Pruning Power of Strong Stubborn Sets and Expansion Core
In the last years, pruning techniques based on partial order reduction have found increasing attention in the planning community. One recent result is that the expansion core method is a special case of the strong stubborn sets method proposed in model checking. However, it is still an open question if there exist efficiently computable strong stubborn sets with strictly higher pruning power th...
متن کاملEfficient Detection of Deadlocks in Petri Nets
Reachability analysis is a powerful formal method for analysis of concurrent and distributed nite state systems. It suuers from the state space explosion problem, however: the state space of a system can be far too large to be completely generated. This report considers two promising methods, Valmari's stubborn set method and Godefroid's sleep set method, to avoid generating all of the state sp...
متن کامل